FIRST-ORDER POSSIBILITY MODELS AND FINITARY COMPLETENESS PROOFS

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

First-order Possibility Models and Finitary Completeness Proofs

This paper builds on Humberstone’s idea of defining models of propositional modal logic where total possible worlds are replaced by partial possibilities. We follow a suggestion of Humberstone by introducing possibility models for quantified modal logic. We show that a simple quantified modal logic is sound and complete for our semantics. Although Holliday showed that for many propositional mod...

متن کامل

A Finitary System for First Order Logic

We present an inference system for classical first order logic in which each inference rule, including the cut, only has a finite set of premises to chose from. The main conceptual contribution of this paper is the possibility of separating different sources of infinite choice, which happen to be entangled in the traditional cut rule.

متن کامل

First-Order Proofs for Higher-Order Languages

We study the use of the-calculus for semantical descriptions of higher-order concurrent languages with state. As an example, we choose Concurrent Idealized ALGOL (CIA). CIA is particularly interesting as, yet being a core language, it combines imperative and parallel features with a procedural mechanism of full higher order. It can thus be used as a formal model for concurrent programs as, e.g....

متن کامل

Uniform proofs of standard completeness for extensions of first-order MTL

We provide general –and automatedly verifiable– sufficient conditions that ensure standard completeness for logics formalized Hilbert-style. Our approach subsumes many existing results and allows for the discovery of new fuzzy logics which extend first-order Monoidal T-norm Logic with propositional axioms.

متن کامل

Pretopologies and Completeness Proofs

Pretopologies were introduced in [S] and there shown to give a complete semantics for a propositional sequent calculus BL here called basic linear logic, as well as for its extensions by structural rules, ex falso quodlibet or double negation. Immediately after the Logic Colloquium ’88, conversation with Per Martin-Löf helped me to see how the pretopology semantics should be extended to predica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Review of Symbolic Logic

سال: 2019

ISSN: 1755-0203,1755-0211

DOI: 10.1017/s1755020319000418